
/*
*Released on 28th June 2008.
*Any violations can be reported at paritosh@wikiocean.net
*What is treated as violations can be found at www.wikiocean.net/ppl1-voilations*
******************************************************************************
* The contents of this file are subject to POOL Public License 1.0 and later.
* POOL Public License is based on Affero GPL v3 and additional conditions.
* ("License"); You may not use this file except in compliance with the License
* You may obtain a copy of the Affero GPL v3 License at http://www.gnu.org/licenses/agpl.html
* You may obtain a copy of the POOL Public License 1.0 or later at www.wikiocean.net/license/ppl.html
* Software distributed under POOL Public License 1.0 is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License for
* the specific language governing rights and limitations under the License.
* The Initial Developer of the Original Code is Paritosh Pungaliya (C) 2008. All Rights Reserved.
******************************************************************************
* Objective of the additional terms (license)
* 1) Is to extend the software freedom to freedom to work.
* 2) To ensure that knowledge is free from monopoly of agencies.
* 3) To avoid a situation where big corporate or investor can buy out free software groups and companies and then start milking the communities built around it.
* (this trend can be seen how the freedom is curtailed in companies that get Venture Capital funding.)
******************************************************************************
*/

package  logger;

import java.io.File;
import java.io.RandomAccessFile;
import java.util.Hashtable;

import database.RecordSearch;
import dbmanager.DBManager;
//import file.SearchRecord;
import User.Uservalidation;



public class AddSmsLog 
{
	String path;
	//SearchRecord sr;
	RecordSearch ps;
	PoolLogger pl;
	
	public AddSmsLog(String path)
	{
		this.path = path;
		// logger
		pl = (PoolLogger) PoolLogger.getLogger(this.getClass().getName());
	}
	
	public boolean Addlog(String username1,String Msg)
	{
		File file = new File(path);
		RandomAccessFile raf ;
		try 
		{
			if(file.exists() == false)
				file.createNewFile();
			if(file.length()==0)
			{
				raf = new RandomAccessFile(file,"rws");
				raf.writeBytes("RECEIVER\t\tMESSAGE\tNumberofSms\tKnownOrUnknown\n");
			}
			else
			{
				raf = new RandomAccessFile(file,"rws");
				raf.seek(raf.getFilePointer());
			}	
			try
			{	
				Hashtable<Object, Object>table = new Hashtable<Object, Object>();
				table.put("RECEIVER",username1);
				/*sr = new SearchRecord(raf);
				String line[] = sr.getRecordSet(table);*/
				ps = new RecordSearch();
				ps.setConditionMap(table);
				String line[] = ps.getArrayFromResultSet();
				//int numbersmstsend  = Msg.length()/168;
				if(line.length<1)
				{	
					Uservalidation uservalidation = new Uservalidation();
					raf.seek(raf.length());
					if(uservalidation.validate_User(username1))
						raf.writeBytes(username1+"\t"+Msg+"\t"+Integer.toString(1)+"\t"+"Y"+"\n");
					else
						raf.writeBytes(username1+"\t"+Msg+"\t"+Integer.toString(1)+"\t"+"N"+"\n");
					return true;
				}
				else
				{
					String Split[];
					int Numberofsms;
					String last_result = line[line.length-1];
					Split = last_result.split("\t");
					
					Numberofsms = Integer.parseInt(Split[2]);
					Numberofsms++;
					String Known=Split[3];
					
					raf.seek(raf.length());
					if(Known.equals("Y")) 
					{
							if(Numberofsms<=10)
							{
								raf.writeBytes(username1+"\t"+Msg+"\t"+Integer.toString(Numberofsms)+"\t"+Known+"\n");
								return true;
							}	
					}
					else
					{
						if(Numberofsms<1)
						{
							raf.writeBytes(username1+"\t"+Msg+"\t"+Integer.toString(1)+"\t"+Known+"\n");
							return true;
						}	
					}	
				}
			}
			catch (Exception e) 
			{
				e.printStackTrace();
			}
			raf.close();
		}
		catch (Exception e) 
		{
			e.printStackTrace();
		}
		return false;
		
	}
}
